The well-separated pair decomposition for balls

نویسندگان

Abolfazl Poureidi

Mohammad Farshi

چکیده

Given a real number t > 1, a geometric t-spanner is a geometric graph for a point set in R with straight lines between vertices such that the ratio of the shortest-path distance between every pair of vertices in the graph (with Euclidean edge lengths) to their actual Euclidean distance is at most t. An imprecise point set is modeled by a set R of regions in R. If one chooses a point in each region of R, then the resulting point set is called a precise instance of R. An imprecise t-spanner for an imprecise point set R is a graph G = (R,E) such that for each precise instance S of R, graph GS = (S,ES), where ES is the set of edges corresponding to E, is a t-spanner. In this paper, we show that, given a real number t > 1, there is an imprecise point set R of n straight-line segments in the plane such that any imprecise t-spanner for R has Ω(n) edges. Then, we propose an algorithm that computes a Well-Separated Pair Decomposition (WSPD) of size O(n) for a set of n pairwise disjoint d-dimensional balls with arbitrary sizes. Given a real number t > 1 and given a set of n pairwise disjoint d-balls with arbitrary sizes, we use this WSPD to compute in O(n log n + n/(t − 1)) time an imprecise t-spanner with O(n/(t − 1)) edges for balls.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

INDEX TERMS: none.

Well-separated pair decomposition, introduced by Callahan and Kosaraju [3], has found numerous applications in solving proximity problems for points in the Euclidean space. A pair of point sets (A, B) is c-well-separated if the distance between A,B is at least c times the diameters of both A and B. A well-separated pair decomposition of a point set consists of a set of well-separated pairs that...

متن کامل

Optimal Parallel All-Nearest-Neighbors Using the Well-Separated Pair Decomposition (Preliminary Version)

We present an optimal parallel algorithm to construct the well-separated pair decomposition of a point set P in < d. We show how this leads to a deterministic optimal O(logn) time parallel algorithm for nding the k-nearest-neighbors of each point in P, where k is a constant. We discuss several additional applications of the well-separated pair decomposition for which we can derive faster parall...

متن کامل

Optimal Parallel All-Nearest-Neighbors Using the Well-Separated Pair Decomposition

W e present an optimal parallel algorithm t o construct the well-separated pair decomposition of a point set P in Zd. W e show how this leads to a deterministic opt imal O(1ogn) t ime parallel algorithm for finding the k nearest neighbors of each point in P, where k is a constant. W e discuss several additional applications of the well-separated pair decomposition for which we can derive fas t ...

متن کامل